A Bit-Wise Epistasis Measure for Binary Search Spaces

نویسندگان

  • Cyril Fonlupt
  • Denis Robilliard
  • Philippe Preux
چکیده

The epistatic variance has been introduced by Davidor as a tool for the evaluation of interdependences between genes, thus possibly giving clues about the diiculty of optimizing functions with genetic algorithms (GAs). Despite its theoretical grounding in Walsh function analysis, several studies have shown its weakness as a predictor of GAs results. In this paper, we focus on binary search spaces and propose to measure epistatic eeect on the level of individual genes, an approach that we call bit-wise epistasis. We give examples of this measure on several well-known test problems, then we take into account this supplementary information to improve the performances of evolutionary algorithms. We conclude by pointing towards possible extensions of this concept to real size problems.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Modelling Genetic Algorithms: From Markov Chains to Dependence with Complete Connections

A Timing Analysis of Convergence to Fitness Sharing Equilibrium p. 23 Where Elitists Start Limping: Evolution Strategies at Ridge Functions p. 34 A Bit-Wise Epistasis Measure for Binary Search Spaces p. 47 Inside GA Dynamics: Ground Basis for Comparison p. 57 The Effect of Spin-Flip Symmetry on the Performance of the Simple GA p. 67 Fitness Distance Correlation and Ridge Functions p. 77 Acceler...

متن کامل

Epistasis on Finite and Infinite Spaces

The main purpose of this text is to present a brief overview of recent results on epistasis. The first part of the note introduces epistasis and deals with epistasis on finite search spaces. It covers both minimally epistatic, i.e., linear, and maximally epistatic functions. The second part introduces epistasis and excess values on infinite search spaces. Some properties of this generalization ...

متن کامل

A Secure and Dynamic Multi-keyword Ranked Search Scheme over Encrypted Cloud Data

The major aim of this paper is to solve the problem of multi-keyword ranked search over encrypted cloud data (MRSE) at the time of protecting exact method wise privacy in the cloud computing concept. Data holders are encouraged to outsource their difficult data management systems from local sites to the business public cloud for large flexibility and financial savings. However for protecting da...

متن کامل

A Novel Technique for Steganography Method Based on Improved Genetic Algorithm Optimization in Spatial Domain

This paper devotes itself to the study of secret message delivery using cover image and introduces a novel steganographic technique based on genetic algorithm to find a near-optimum structure for the pair-wise least-significant-bit (LSB) matching scheme. A survey of the related literatures shows that the LSB matching method developed by Mielikainen, employs a binary function to reduce the numbe...

متن کامل

Recurrent Binary Embedding for GPU-Enabled Exhaustive Retrieval from Billion-Scale Semantic Vectors

Rapid advances in GPU hardware and multiple areas of Deep Learning open up a new opportunity for billion-scale information retrieval with exhaustive search. Building on top of the powerful concept of semantic learning, this paper proposes a Recurrent Binary Embedding (RBE) model that learns compact representations for real-time retrieval. The model has the unique ability to refine a base binary...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998